Design and analysis of numerical algorithms for the solution of linear systems on parallel and distributed architectures

The increasing availability of parallel computers is having a very significant impact on all aspects of scientific computation, including algorithm research and software development in numerical linear algebra. In particular, the solution of linear systems, which lies at the heart of most calculations in scientific computing is an important computation found in many engineering and scientific applications. In this thesis, well-known parallel algorithms for the solution of linear systems are compared with implicit parallel algorithms or the Quadrant Interlocking (QI) class of algorithms to solve linear systems. These implicit algorithms are (2x2) block algorithms expressed in explicit point form notation. [Continues.

A middle agent based super architecture for scalable and efficient service discovery

It is typical that in a multi-agent system there exist service requestor agents that search for suitable service provider agents to solve specific problems.In this environment, service discovery can be achieved with the use of a middle agent (MA) who provides matchmaking services.Multiple federated MAs can be employed and dynamically discovered to avoid bottleneck problem and single point of failure.In addition, a peer-to-peer (P2P)network can be utilized for a wider scope of discovery.In this paper, we propose a middle agent based super peer architecture (MESRA) for wide area service discovery.We explore scalable and efficient discovery through exploration which results in the formation of similar overlay networks and monitoring which caches service requests results.Simulation experiments show that MESRA provides better performance as compared to discovery through purely super peer (PSP) and Gnutella based overlay network

Building distributed heterogeneous smart phone Java applications an evaluation from a development perspective

The advances in mobile phone technology have enabled such devices to be programmed to run general-purpose applications using a special edition of the Java programming language. Java is designed to be a heterogeneous programming language targeting different platforms. Such ability when coupled with the provision of high-speed mobile Internet access would open the door for a new breed of distributed mobile applications. This paper explores the capabilities and limitations of this technology and addresses the considerations that must be taken when designing and developing such distributed applications. Our findings are verified by building a test client-server system where the clients in this system are mobile phones behaving as active processing elements not just mere service requesters

Kesan Penggunaan Teknik Pengurusan Tekanan terhadap Pencapaian Akademik (CGPA) Kajian Kes : Pelajar UiTM Arau, Perlis

The aim of this study in general is to see the effect of stress management techniques on academic achievement (CGPA) of final semester students of UiTM Arau, Perlis. The specific objective of this study is to see whether students who practice stress management techniques obtained higher CGPA than those who do not practice stress management techniques. This is done by looking at the corelation between stress management techniques of time management, social support, exercise, relaxation and CGPA. The study used questionnaires which had been used by Whetten, Cameron and Woods (1996) for time management, Freed (1984) for social support and Trockel, Barnes and Egget (2000) for exercise and relaxation. Cronbach alpha values of this questionnaire are 0.84 for time management, 0.895 for social support and exercise and 0.73 for relaxation. The result of this study showed that there was no significant co-relations between time management, social support, exercise, relaxation and CGPA of final semester students of UiTM Arau. Therefore, the study concluded that students who practiced stress management techniques do not necessarily obtained higher CGPA than those who do not. However, results of this study showed that there are significant differences in the usage of these stress management techniques between males and females and between diploma and degree level students

Parallel Geometric Hashing Algorithm For Protein Tertiary Structure.

The amount of protein structure has become very huge nowadays, which has led to the need for improving algorithms to cope with this exponential increase. At the same time, processors have become more powerful and affordable with low price

Parallel Homologous Search With Hirschberg Algorithm: A Hybrid MPI-Pthreads Solution.

In this paper, we apply two different parallel programming model, the message passing model using Message Passing Interface (MPI) and the multithreaded model using Pthreads, to-protein sequence homologous search. The protein sequence homologous search uses Hirschberg algorithm for the pair-wise sequence alignment

Extending Health Information System Evaluation with an Importance‐Performance Map Analysis

Evaluation of a health information system is necessary for determining effective use and for enhancing the productivity of medical practitioners. However, the current system evaluation toolkit does not recommend specific areas required for further improvement. The objective of this chapter was to identify those constructs and their attributes that were the most suitable candidates for managerial intervention by applying partial least squares structural equation modeling. In doing so, the quantitative survey was adopted from the past studies together with new items creation representing system quality, records quality, service quality, and knowledge quality as the predictors while effective use and user performance as the outcomes. When extending the findings in importance‐performance map analysis, two‐system quality attributes (workflows fit and work styles fit) and all‐knowledge quality attributes exhibited higher importance rank for managerial actions. The chapter also provides a valuable recommendation for the policy and decision‐makers at the managerial level on how to apply the proposed system evaluation method in producing more efficient strategic‐planning strategies for further system upgrades and new implementation at health facilities

Data Pre Processing Methodology for Computational Experiment in Analyzing Protein Interaction Networks

The aim of this process flow is to fulfill the requirement oj our graph-based algorithm's solution and to ensure that the representation of protein interaction network which consist ofnodes and edges are accurate

Two-Dimensional Digitized Picture Arrays and Parikh Matrices

Parikh matrix mapping or Parikh matrix of a word has been introduced in the literature to count the scattered subwords in the word. Several properties of a Parikh matrix have been extensively investigated. A picture array is a two-dimensional connected digitized rectangular array consisting of a finite number of pixels with each pixel in a cell having a label from a finite alphabet. Here we extend the notion of Parikh matrix of a word to a picture array and associate with it two kinds of Parikh matrices, called row Parikh matrix and column Parikh matrix. Two picture arrays A and B are defined to be M-equivalent if their row Parikh matrices are the same and their column Parikh matrices are the same. This enables to extend the notion of M-ambiguity to a picture array. In the binary and ternary cases, conditions that ensure M-ambiguity are then obtained